A note on I-completeness of NP-witnessing relations
نویسنده
چکیده
In this note, we study under which conditions various sets (even easy ones) can be associated with a witnessing relation that is #P complete. We show a sufficient condition for an NP set to have such a relation. This condition applies also to many NP-complete sets, as well as to many sets in P .
منابع مشابه
Universal Relations and #P-Completeness
This paper follows the methodology introduced by Agrawal and Biswas in [AB92], based on a notion of universality for the relations associated with NP-complete problems. The purpose was to study NP-complete problems by examining the effects of reductions on the solution sets of the associated witnessing relations. This provided a useful criterion for NP-completeness while suggesting structural s...
متن کاملUniversality for Nondeterministic Logspace
The notion of universality was introduced [AB92] in 1992 in the context of NP. The major motivation of the work was to capture in a theory the essential sameness of various NPcompleteness proofs. The approach was to find out precisely what is preserved by natural reductions. When we wish to show that a language A polynomial time, many-one reduces to an NP-complete language B vis a reduction f ,...
متن کاملNotes on NP Completeness
Here are some notes which I wrote to try to understand what NP completeness means. Most of these notes are taken from Appendix B in Douglas West’s graph theory book, and also from wikipedia. There’s nothing remotely original about these notes. I just wanted all this material to filter through my brain and onto paper. I also wanted to collect everything together in a way I like. Here’s what thes...
متن کاملA note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs
The precoloring extension coloring problem consists in deciding, given a positive integer k, a graph G = (V,E) and k pairwise disjoint subsets V0, . . . , Vk−1 of V , if there exists a (vertex) coloring S = (S0, . . . , Sk−1) of G such that Vi ⊆ Si, for all i = 0, . . . , k − 1. In this note, we show that the precoloring extension coloring problem is NP-complete in triangle free planar graphs w...
متن کاملA Generic NP-hardness Proof for a Variant of Graph Coloring
In this note, a direct proof is given of the NP-completeness of a variant of Graph Coloring, i.e., a generic proof is given, similar to the proof of Cook of the NPcompleteness of Satisfiability. Then, transformations from this variant of Graph Coloring to Independent Set and to Satisfiability are given. These proofs could be useful in an educational setting, where basics of the theory of NP-com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 109 شماره
صفحات -
تاریخ انتشار 2009